Communication primitives for unstructured finite element simulations on data parallel architectures
نویسندگان
چکیده
E cient data motion is critical for high performance computing on distributed memory architectures. The value of some techniques for e cient data motion is illustrated by identifying generic communication primitives. Further, the e ciency of these primitives is demonstrated on three di erent applications using the nite element method for unstructured grids and sparse solvers with di erent communication requirements. For the applications presented, the techniques advocated reduced the communication times by a factor of between 1.5 { 3.
منابع مشابه
Communication Primitives for Unstructured Finite Element Simulations on Data Parallel Architectures Communication Primitives for Unstructured Finite Element Simulations on Data Parallel Architectures
EEcient data motion is critical for high performance computing on distributed memory architectures. The value of some techniques for eecient data motion is illustrated by identifying generic communication primitives. Further, the eeciency of these primitives is demonstrated on three diier-ent applications using the nite element method for unstructured grids and sparse solvers with diierent comm...
متن کاملMassively Parallel Computing: Unstructured Finite Element Simulations
Massively parallel computing holds the promise of extreme performance. Critical for achieving high performance is the ability to exploit locality of reference and eeective management of the communication resources. This article describes two communication primitives and associated mapping strategies that have been used for several diierent un-structured, three-dimensional, nite element applicat...
متن کاملAn Eecient Communication Strategy for Finite Element Methods on the Connection Machine Cm-5 System an Eecient Communication Strategy for Finite Element Methods on the Connection Machine Cm-5 System
The objective of this paper is to propose communication procedures suitable for unstructured nite element solvers implemented on distributed-memory parallel computers such as the Connection Machine CM-5 system. First, a data-parallel implementation of the recursive spectral bisection (RSB) algorithm proposed by Pothen et al. is presented. The RSB algorithm is associated with a node renumber-ing...
متن کاملAn Element-Based Concurrent Partitioner for Unstructured Finite Element Meshes
Ding & Ferraro 1 Abstract. A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning strategy. Its main advantage over the more conventional node-based partitioning strategy is its modular programing approach to the development of parallel applications. The partitioner first p...
متن کاملAn Element-Based Concurrent Partitioned for Unstructured Finite Element Meshes
A concurrent partilionerforpartitioning Unstructured finite element meshes on distributed memory architectures is developed. The partitioned uses an element-based partitioning strategy 1[s main advantage over the more conventional node-based partitioning strategy is its modular programing approach to the development of parallel applications. The partitionerfirst partitions element centroids ioi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015